Index Selection in Relational Databases
نویسندگان
چکیده
Intending to develop a tool which aims to support the physical design of relational databases can not be done without considering the problem of index selection. Generally the problem is split into a primary and secondary index selection problem and the selection is done per table. Whereas much attention has been paid on the selection of secondary indices relatively less is known about the selection of a primary index and the relation between them. These are exactly the topics of this paper.
منابع مشابه
Index selection in relational databases - Computing and Information, 1993. Proceedings ICCI '93., Fifth International Conference on
Intending to develop a tool which aims to support the physical design of relational databases can not be done Without considering the problem of index selection. Generally the problem is split into a primary and secondary index selection problem and the selection is done per table. Whereas much attention has been paid on the selection of secondary indices relatively less is known about the sele...
متن کاملFuzzy multi-criteria selection procedures in choosing data source
Technology assessment and selection has a substantial impact on organizations procedures in regards to technology transfer. Technological decisions are usually made by a group of experts, and whereby integrity of these viewpoints to a single decision can be quite complex. Today, operational databases and data warehouses exist to manage and organize data with specific features and henceforth, th...
متن کاملChallenges of Index Recommendation for Databases
One important aspect of physical database design is the selection of a proper set of indexes for a workload. Creation of indexes in a database system is subject to storage constraints. It is also affected by the ratio of update operations in the workload. Therefore, the cost and benefit of each set of indexes should be evaluated by a proper optimization method. The large number of index sets th...
متن کاملA Novel Reversible Watermarking Scheme for Relational Databases Protection Based on Histogram Shifting
The watermarking technique can be used to protect the ownership of relational databases by hiding some ownership information into the relational databases. In this paper, a novel robust reversible watermarking scheme for relational database protection is proposed to increase the embedding capacity by developing an improved histogram shifting with binary tree structure and an attribute selection...
متن کاملSelecting Materialized Views for RDF Data
In the design of a relational database, the administrator has to decide, given a fixed or estimated workload, which indexes should be created. This so called index selection problem is an non-trivial optimization problem in relational databases. In this paper we describe a novel approach for index selection on RDF data sets. We propose an algorithm to automatically suggest a set of indexes as m...
متن کامل